Verified Computer Algebra in Acl2. Gröbner Bases Computation
نویسندگان
چکیده
In this paper, we present the formal verification of a Common Lisp implementation of Buchberger’s algorithm for computing Gröbner bases of polynomial ideals. This work is carried out in the Acl2 system and shows how verified Computer Algebra can be achieved in an executable logic.
منابع مشابه
Proof of Dickson’s Lemma Using the ACL2 Theorem Prover via an Explicit Ordinal Mapping
In this paper we present the use of the ACL2 theorem prover to formalize and mechanically check a new proof of Dickson’s lemma about monomial sequences. Dickson’s lemma can be used to establish the termination of Büchberger’s algorithm to find the Gröbner basis of a polynomial ideal. This effort is related to a larger project which aims to develop a mechanically verified computer algebra system.
متن کاملComprehensive Gröbner Bases in a Java Computer Algebra System
We present an implementation of the algorithms for computing comprehensive Gröbner bases in a Java computer algebra system (JAS). Contrary to approaches to implement comprehensive Gröbner bases with minimal requirements to the computer algebra system, we aim to provide and utilize all necessary algebraic structures occurring in the algorithm. In the implementation of a condition we aim at the m...
متن کاملExtending Clause Learning of SAT Solvers with Boolean Gröbner Bases
We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra s...
متن کاملTime Optimal Control Using Gröbner Bases
Abstract: The paper presents the solution of the time optimal control with the help of Gröbner Bases theory. First the set of polynomial equations for the triple integrator system with unknowns corresponding to the switching times is constructed and later it is solved in the computer algebra system Maple using the Groebner library. In dependence of resulting switching times the control action i...
متن کاملComputing one of Victor Moll's irresistible integrals with computer algebra
We investigate a certain quartic integral from V. Moll’s book “Irresistible Integrals” and demonstrate how it can be solved by computer algebra methods, namely by using non-commutative Gröbner bases. We present recent implementations in the computer algebra systems Singular and Mathematica.
متن کامل